Random packing of rods in small containers
نویسندگان
چکیده
منابع مشابه
Close packing of rods on spherical surfaces.
We study the optimal packing of short, hard spherocylinders confined to lie tangential to a spherical surface, using simulated annealing and molecular dynamics simulations. For clusters of up to twelve particles, we map out the changes in the geometry of the closest-packed configuration as a function of the aspect ratio L/D, where L is the cylinder length and D the diameter of the rods. We find...
متن کاملTwo Dimensional Packing of Granular Rods
We investigate the two-dimensional packing properties of prolate granular materials. As the dynamics of formation can be influenced by the method of delivery of the prolate particles to the surface, we experiment with different methods which include changing the viscosity of the medium as well. For an aspect ratio of Length/Diameter = 30 the average packing fraction for the rods is found to be ...
متن کاملPacking non-equal spheres into containers of different shapes
The article reviews a mathematical model of the optimization problem of packing different spheres into a container which can be a cuboid, a sphere, a right circular cylinder, an annular cylinder and a spherical layer. The assumption that sphere radii are variable is exploited. Based on the hypothesis a new way to derive starting point belonging to the feasible region of the problem is offered. ...
متن کاملPacking arborescences in random digraphs
We study the problem of packing arborescences in the random digraph D(n, p), where each possible arc is included uniformly at random with probability p = p(n). Let λ(D(n, p)) denote the largest integer λ ≥ 0 such that, for all 0 ≤ ` ≤ λ, we have ∑`−1 i=0(`− i)|{v : din(v) = i}| ≤ `. We show that the maximum number of arcdisjoint arborescences in D(n, p) is λ(D(n, p)) a.a.s. We also give tight e...
متن کاملApproximating Smallest Containers for Packing Three-Dimensional Convex Objects
We investigate the problem of computing a minimum volume container for the non-overlapping packing of a given set of three-dimensional convex objects. Already the simplest versions of the problem are NPhard so that we cannot expect to find exact polynomial time algorithms. We give constant ratio approximation algorithms for packing axis-parallel (rectangular) cuboids under translation into an a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Granular Matter
سال: 2019
ISSN: 1434-5021,1434-7636
DOI: 10.1007/s10035-019-0939-x